Geometric algorithms for containment analysis of rotational parts
نویسندگان
چکیده
This paper describes a system and underlying algorithms to perform geometric containment analysis to determine if a newly designed rotational part can be manufactured from a part in an existing database of rotational parts. Only material removal of the database part is considered in order to obtain the newly designed part from the database part. The system uses a three-step algorithm to test for containment. The first step analyzes feasibility of containment using bounding cylinders. If the bounding cylinder of the query part is bigger than the part in the database, then the database part cannot contain the query part and it is eliminated from consideration. The second step analyzes feasibility of containment by ignoring off-axis features. Any part that fails to satisfy containment at this stage is eliminated from consideration. The third step analyzes the remaining parts from the database for feasibility of containment by including the off-axis features. Finally, the system rank-orders all the database parts that can contain the query part based on their volume differences with the query part. The system described in this paper can be used by designers and process planners to find an existing part that can be used as a stock to manufacture a newly designed part. This capability is expected to significantly reduce proliferation of parts, to improve manufacturing responsiveness, and to reduce the cost of new products.
منابع مشابه
Geometric Containment Analysis for Rotational Parts
This paper describes algorithms and a system for performing geometric containment analysis to determine if a newly designed rotational part can be manufactured from a part in a database of existing rotational parts by performing additional material removal operations. The system has two working modes. In the first mode, we generate a signature for each solid model residing in a database of prev...
متن کاملTranslational Polygon Containment and Minimal Enclosure Using Geometric Algorithms and Mathematical Programming Translational Polygon Containment and Minimal Enclosure Using Geometric Algorithms and Mathematical Programming
We present an algorithm for the two-dimensional translational containment problem: nd translations for k polygons (with up to m vertices each) which place them inside a polygonal container (with n vertices) without overlapping. The polygons and container may be nonconvex. The containment algorithm consists of new algorithms for restriction, evaluation, and subdivision of two-dimensional conngur...
متن کاملANT COLONY ALGORITHMS FOR NONLINEAR ANALYSIS AND OPTIMAL DESIGN OF STRUCTURES
In this paper nonlinear analysis of structures are performed considering material and geometric nonlinearity using force method and energy concepts. For this purpose, the complementary energy of the structure is minimized using ant colony algorithms. Considering the energy term next to the weight of the structure, optimal design of structures is performed. The first part of this paper contains ...
متن کاملTranslational Polygon Containment and Minimal Enclosure Using Mathematical Programming
We present a new algorithm for the two-dimensional translational containment problem: nd translations for k polygons which place them inside a polygonal container without overlapping. Both the polygons and the container can be nonconvex. The algorithm is based on mathematical programming principles. We generalize our containment approach to solve minimal enclosure problems. We give algorithms t...
متن کاملAn investigation the effects of geometric tolerances on the natural frequencies of rotating shafts
This paper examines the effects of geometric tolerances on the natural frequencies of rotating shafts. In order to model the tolerances, a code is written in MATLAB 2013 that produces deviated points. Deviated points are controlled by different geometric tolerances, including cylindricity, total run-out and coaxiality tolerances. Final surfaces and models passing through the points are created ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer-Aided Design
دوره 37 شماره
صفحات -
تاریخ انتشار 2005